Lattice polymer automata
نویسندگان
چکیده
منابع مشابه
Lattice Polymer Automata
We present a new style of molecular dynamics and self-assembly simulation, the Lattice Polymer Automaton [LPA]. In the LPA all interactions, including electromagnetic forces, are decomposed and communicated via propagating particles, \photons". The monomer-monomer bond forces, the molecular excluded volume forces, the longer range intermolecular forces, and the polymer-solvent interactions may ...
متن کاملLattice Gas Automata Simulation of Adsorption Process of Polymer in Porous Media
Lattice gas automata (LGA) model is developed to simulate polymer adsorption process by adding some collision rules. The simulation result of the model is matched with batch experiment and compared with accepted isothermal adsorption equations. They show that the model is viable to perform simulation of the polymer adsorption process. The LGA model is then applied for simulating continuous poly...
متن کاملLattice Automata
Several verification methods involve reasoning about multi-valued systems, in which an atomic proposition is interpreted at a state as a lattice element, rather than a Boolean value. The automata-theoretic approach for reasoning about Boolean-valued systems has proven to be very useful and powerful. We develop an automata-theoretic framework for reasoning about multi-valued objects, and describ...
متن کاملGENERAL FUZZY AUTOMATA BASED ON COMPLETE RESIDUATED LATTICE-VALUED
The present paper has been an attempt to investigate the general fuzzy automata on the basis of complete residuated lattice-valued ($L$-GFAs). The study has been chiefly inspired from the work by Mockor cite{15, 16, 17}. Regarding this, the categorical issue of $L$-GFAs has been studied in more details. The main issues addressed in this research include: (1) investigating the relationship betwe...
متن کاملApproximating Deterministic Lattice Automata
Traditional automata accept or reject their input, and are therefore Boolean. Lattice automata generalize the traditional setting and map words to values taken from a lattice. In particular, in a fully-ordered lattice, the elements are 0, 1, . . . , n − 1, ordered by the standard ≤ order. Lattice automata, and in particular lattice automata defined with respect to fully-ordered lattices, have i...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Berichte der Bunsengesellschaft für physikalische Chemie
سال: 1994
ISSN: 0005-9021
DOI: 10.1002/bbpc.19940980924